Deriving Controllable Local Optimal Solutions through an Environment Parameter Fixed Algorithm

نویسندگان

چکیده

This paper addresses the challenge of optimizing objective functions in engineering problems influenced by multiple environmental factors, such as temperature and humidity. Traditional modeling approaches often struggle to capture complexities non-ideal situations. In this research, we propose a novel approach called Environment Parameter Fixed Algorithm (EPFA) for function deep neural network (DNN) trained specific environment. By fixing parameters DNN defined function, transform original optimization problem into control parameter problem. We integrate EPFA-CLS (Controllable local-Optimal Solution) with Gradient Descent algorithms Adagrad obtain optimal solution. To demonstrate concept, apply our an course model validate it using Boston house price datasets. The results effectiveness handling complex environments, offering promising outcomes practical applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parameter Estimation from an Optimal Projection in a Local Environment

The parameter fit from a model grid is limited by our capability to reduce the number of models, taking into account the number of parameters and the non linear variation of the models with the parameters. The Local MultiLinear Regression (LMLR) algorithms allow one to fit linearly the data in a local environment. The MATISSE algorithm, developed in the context of the estimation of stellar para...

متن کامل

Local Optimal Solutions for DCOP: New Criteria, Bound, and Algorithm

Distributed constraint optimization (DCOP) is a popular formalism for modeling cooperative multi-agent systems. In large-scale networks, finding a global optimum using complete algorithms is often impractical, which leads to the study on incomplete algorithms. Traditionally incomplete algorithms can only find locally optimal solution with no quality guarantees. Recent work on ksize-optimality h...

متن کامل

An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees

In computational phylogenetics, the problem of constructing a consensus tree for a given set of input trees has frequently been addressed. In this paper we study the Minimum-Flip Problem: the input trees are transformed into a binary matrix, and we want to find a perfect phylogeny for this matrix using a minimum number of flips, that is, corrections of single entries in the matrix. In its graph...

متن کامل

An Improved Fixed-Parameter Algorithm for Vertex Cover

The VERTEX COVER problem asks, for input consisting of a graph G on n vertices, and a positive integer k, whether there is a set of k vertices such that every edge of G is incident with at least one of these vertices. We give an algorithm for this problem that runs in time O(kn + (1.324718)'k'). In particular, this gives an 0((1.324718) " n2) algorithm to find the minimum vertex cover in the gr...

متن کامل

Learning Optimal Parameter Values in Dynamic Environment: An Experiment with Softmax Reinforcement Learning Algorithm

1. Introduction Many learning and heuristic search algorithms require tuning of parameters to achieve optimum performance. In stationary and deterministic problem domains this is usually achieved through off-line sensitivity analysis. However, this method breaks down in non-stationary and non-deterministic environments, where the optimal set of values for the parameters keep changing over time....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2023

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app13127110